Constants Count: Practical Improvements to Oblivious RAM
نویسندگان
چکیده
Oblivious RAM (ORAM) is a cryptographic primitive that hides memory access patterns as seen by untrusted storage. This paper proposes Ring ORAM, the most bandwidth-efficient ORAM scheme for the small client storage setting in both theory and practice. Ring ORAM is the first tree-based ORAM whose bandwidth is independent of the ORAM bucket size, a property that unlocks multiple performance improvements. First, Ring ORAM’s overall bandwidth is 2.3× to 4× better than Path ORAM, the prior-art scheme for small client storage. Second, if memory can perform simple untrusted computation, Ring ORAM achieves constant online bandwidth (∼ 60× improvement over Path ORAM for practical parameters). As a case study, we show Ring ORAM speeds up program completion time in a secure processor by 1.5× relative to Path ORAM. On the theory side, Ring ORAM features a tighter and significantly simpler analysis than Path ORAM.
منابع مشابه
Distributed Oblivious RAM for Secure Two-Party Computation
We present a new method for secure two-party Random Access Memory (RAM) program computation that does not require taking a program and first turning it into a circuit. The method achieves logarithmic overhead compared to an insecure program execution. In the heart of our construction is a new Oblivious RAM construction where a client interacts with two non-communicating servers. Our two-server ...
متن کاملComparison of Access Pattern Protection Schemes and Proposals for Efficient Implementation
Oblivious RAM (ORAM) schemes, the concept introduced by Goldreich and Ostrovsky, are very useful technique for protecting users’ privacy when storing data in remote untrusted servers and running software on untrusted systems. However they are usually considered impractical due to their huge overhead. In order to reduce overhead, many improvements have been presented. Thanks to these improvement...
متن کاملTowards Practical Oblivious RAM
We take an important step forward in making Oblivious RAM (O-RAM) practical. We pro-pose an O-RAM construction achieving an amortized overhead of 20 ∼ 35X (for an O-RAMroughly 1 terabyte in size), about 63 times faster than the best existing scheme. On the theoreticfront, we propose a fundamentally novel technique for constructing Oblivious RAMs: specifi-cally, we partition a bi...
متن کاملPractical Oblivious RAM and its Applications
Department of Computer Science Doctor of Philosophy
متن کاملOblivious RAM with O((logN)3) Worst-Case Cost
Oblivious RAM (O-RAM) is a useful primitive that allows a client to hide its data access patterns from an untrusted server in storage outsourcing applications. This paper proposes novel O-RAM constructions that achieves poly-logarithmic worst-case cost, while consuming constant client-side storage. Our techniques for constructing Oblivious RAM are fundamentally different from previous approache...
متن کامل